Spectral radius and signless Laplacian spectral radius of strongly connected digraphs

نویسندگان

  • Wenxi Hong
  • Lihua You
چکیده

Article history: Received 15 April 2014 Accepted 5 May 2014 Available online 29 May 2014 Submitted by R. Brualdi MSC: 05C20 05C50 15A18

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Signless Laplacian Spectral Characterization of Strongly Connected Bicyclic Digraphs

Let −→ G be a digraph and A( −→ G) be the adjacency matrix of −→ G . Let D( −→ G) be the diagonal matrix with outdegrees of vertices of −→ G and Q( −→ G) = D( −→ G) + A( −→ G) be the signless Laplacian matrix of −→ G . The spectral radius of Q( −→ G) is called the signless Laplacian spectral radius of −→ G . In this paper, we determine the unique digraph which attains the maximum (or minimum) s...

متن کامل

On spectral radius of strongly connected digraphs

 It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.  

متن کامل

On the distance signless Laplacian spectral radius of graphs and digraphs

Let η(G) denote the distance signless Laplacian spectral radius of a connected graph G. In this paper, bounds for the distance signless Laplacian spectral radius of connected graphs are given, and the extremal graph with the minimal distance signless Laplacian spectral radius among the graphs with given vertex connectivity and minimum degree is determined. Furthermore, the digraph that minimize...

متن کامل

On Complementary Distance Signless Laplacian Spectral Radius and Energy of Graphs

Let $D$ be a diameter and $d_G(v_i, v_j)$ be the distance between the vertices $v_i$ and $v_j$ of a connected graph $G$. The complementary distance signless Laplacian matrix of a graph $G$ is $CDL^+(G)=[c_{ij}]$ in which $c_{ij}=1+D-d_G(v_i, v_j)$ if $ineq j$ and $c_{ii}=sum_{j=1}^{n}(1+D-d_G(v_i, v_j))$. The complementary transmission $CT_G(v)$ of a vertex $v$ is defined as $CT_G(v)=sum_{u in ...

متن کامل

The Signless Dirichlet Spectral Radius of Unicyclic Graphs

Let G be a simple connected graph with pendant vertex set ∂V and nonpendant vertex set V0. The signless Laplacian matrix of G is denoted by Q(G). The signless Dirichlet eigenvalue is a real number λ such that there exists a function f ̸= 0 on V (G) such that Q(G)f(u) = λf(u) for u ∈ V0 and f(u) = 0 for u ∈ ∂V . The signless Dirichlet spectral radius λ(G) is the largest signless Dirichlet eigenva...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014